Method and apparatus for performing interpolation based on transform and inverse transform

ABSTRACT

Provided are a method and apparatus for interpolating an image. The method includes: selecting a first filter, from among a plurality of different filters, for interpolating between pixel values of integer pixel units, according to an interpolation location; and generating at least one pixel value of at least one fractional pixel unit by interpolating between the pixel values of the integer pixel units by using the selected first filter.

CROSS-REFERENCE TO RELATED PATENT APPLICATIONS

This is a Continuation of U.S. application Ser. No. 14/218,494, filedMar. 18, 2014, which is a Continuation of U.S. application Ser. No.13/080,319, filed Apr. 5, 2011 and issued as U.S. Pat. No. 8,676,000 onMar. 18, 2014, which claims the benefit of U.S. Provisional ApplicationNo. 61/320,847, filed on Apr. 5, 2010, and U.S. Provisional ApplicationNo. 61/367,498, filed on Jul. 26, 2010, and claims priority from KoreanPatent Application No. 10-2010-0095956, filed on Oct. 1, 2010 in theKorean Intellectual Property Office, the disclosures of which areincorporated herein in their entireties by reference.

BACKGROUND

1. Field

Apparatuses and methods consistent with exemplary embodiments relate tointerpolating an image, and more particularly, to interpolating betweenpixel values of integer pixel units.

2. Description of the Related Art

In a related art image encoding and decoding method, one picture isdivided into a plurality of macro blocks so as to encode an image. Then,each of the plurality of macro blocks is prediction-encoded byperforming inter prediction or intra prediction thereon.

Inter prediction is a method of compressing an image by removing atemporal redundancy between pictures. A representative example of interprediction is motion-estimation encoding. In motion-estimation encoding,each block of a current picture is predicted by using at least onereference picture. A reference block that is the most similar to acurrent block is searched for in a predetermined search range by using apredetermined evaluation function.

The current block is predicted based on the reference block, a residualblock is obtained by subtracting a predicted block, which is the resultof predicting, from the current block, and then the residual block isencoded. In this case, in order to precisely predict the current block,sub pixels that are smaller than integer pixel units are generated byperforming interpolation in a search range of the reference picture, andinter prediction is performed based on the sub pixels.

SUMMARY

Aspects of one or more exemplary embodiments provide a method andapparatus for generating pixel values of fractional pixel units byinterpolating pixel values of integer pixel units.

Aspects of one or more exemplary embodiments also provide a computerreadable recording medium having recorded thereon a computer program forexecuting the method.

According to an aspect of an exemplary embodiment, there is provided amethod of interpolating an image, the method including: selecting afirst filter, from among a plurality of different filters, forinterpolating between pixel values of integer pixel units, according toan interpolation location; and generating at least one pixel value of atleast one fractional pixel unit by interpolating between the pixelvalues of the integer pixel units by using the selected first filter forinterpolating between the pixel values of the integer pixel units.

The method may further include selecting a second filter, from among aplurality of different filters, for interpolating between the generatedat least one pixel value of the at least one fractional pixel unit,according to an interpolation location; and interpolating between thegenerated at least one pixel value of the at least one fractional pixelunit by using the selected second filter for interpolating between thegenerated at least one pixel value of the at least one fractional pixelunit.

The first filter for interpolating between the pixel values of theinteger pixel units may be a spatial-domain filter for transforming thepixel values of the integer pixel units by using a plurality of basisfunctions having different frequencies, and inverse transforming aplurality of coefficients, which are obtained by the transforming thepixel values of the integer pixel units, by using the plurality of basisfunctions, phases of which are shifted.

The second filter for interpolating between the generated at least onepixel value of the at least one fractional pixel unit may be aspatial-domain filter for transforming the generated at least one pixelvalue of the at least one fractional pixel unit by using a plurality ofbasis functions having different frequencies, and inverse transforming aplurality of coefficients, which are obtained by the transforming thegenerated at least one pixel value of the at least one fractional pixelunit, by using the plurality of basis functions, phases of which areshifted.

According to an aspect of another exemplary embodiment, there isprovided an apparatus for interpolating an image, the apparatusincluding: a filter selector which selects a first filter, from among aplurality of different filters, for interpolating between pixel valuesof integer pixel units, according to an interpolation location; and aninterpolator which generates at least one pixel value of at least onefractional pixel unit by interpolating between the pixel values of theinteger pixel units by using the selected first filter for interpolatingbetween the pixel values of the integer pixel units.

The filter selector may select a second filter, from among a pluralityof different filters, for interpolating between the generated at leastone pixel value of the at least one fractional pixel unit, according toan interpolation location, and the interpolator may interpolate betweenthe generated at least one pixel value of the at least one fractionalpixel unit by using the selected second filter for interpolating betweenthe generated at least one pixel value of the at least one fractionalpixel unit.

According to an aspect of another exemplary embodiment, there isprovided a computer readable recording medium having embodied thereon acomputer program for executing the method described above.

According to an aspect of another exemplary embodiment, there isprovided a method of interpolating an image, the method including:transforming pixel values in a spatial domain by using a plurality ofbasis functions having different frequencies; shifting phases of theplurality of basis functions; and inverse transforming a plurality ofcoefficients, obtained by the transforming the pixel values, by usingthe phase-shifted plurality of basis functions.

BRIEF DESCRIPTION OF THE DRAWINGS

The above and other features will become more apparent by describing indetail exemplary embodiments with reference to the attached drawings inwhich:

FIG. 1 is a block diagram of an apparatus for encoding an imageaccording to an exemplary embodiment;

FIG. 2 is a block diagram of an apparatus for decoding an imageaccording to an exemplary embodiment;

FIG. 3 illustrates hierarchical coding units according to an exemplaryembodiment;

FIG. 4 is a block diagram of an image encoder based on a coding unit,according to an exemplary embodiment;

FIG. 5 is a block diagram of an image decoder based on a coding unit,according to an exemplary embodiment;

FIG. 6 illustrates a maximum coding unit, a sub coding unit, and aprediction unit, according to an exemplary embodiment;

FIG. 7 illustrates a coding unit and a transform unit, according to anexemplary embodiment;

FIGS. 8A to 8D illustrate division shapes of a coding unit, a predictionunit, and a transform unit, according to an exemplary embodiment;

FIG. 9 is a block diagram of an image interpolation apparatus accordingto an exemplary embodiment;

FIG. 10 is a diagram illustrating a two-dimensional (2D) interpolationmethod performed by the image interpolation apparatus of FIG. 9,according to an exemplary embodiment;

FIG. 11 is a diagram illustrating an interpolation region according toan exemplary embodiment;

FIG. 12 is a diagram illustrating a one-dimensional (1D) interpolationmethod according to an exemplary embodiment;

FIG. 13 is a diagram specifically illustrating a 1D interpolation methodperformed by the image interpolation apparatus of FIG. 9, according toan exemplary embodiment;

FIG. 14 is a block diagram of an image interpolation apparatus accordingto an exemplary embodiment;

FIG. 15 illustrates 2D interpolation filters according to an exemplaryembodiment;

FIGS. 16A to 16F illustrate 1D interpolation filters according toexemplary embodiments;

FIGS. 17A to 17Y illustrate optimized 1D interpolation filters accordingto exemplary embodiments;

FIGS. 18A and 18B illustrate methods of interpolating pixel values invarious directions by using a 1D interpolation filter, according toexemplary embodiments;

FIG. 19A illustrates a 2D interpolation method according to an exemplaryembodiment;

FIG. 19B illustrates a 2D interpolation method using a 1D interpolationfilter, according to another exemplary embodiment;

FIG. 19C illustrates a 2D interpolation method using a 1D interpolationfilter, according to another exemplary embodiment;

FIG. 20 is a flowchart illustrating an image interpolation methodaccording to an exemplary embodiment;

FIG. 21 is a flowchart illustrating an image interpolation methodaccording to another exemplary embodiment;

FIG. 22 is a flowchart illustrating an image interpolation methodaccording to another exemplary embodiment; and

FIGS. 23A to 23E illustrate methods of performing scaling and roundingoff in relation to a 1D interpolation filter, according to exemplaryembodiments.

DETAILED DESCRIPTION OF EXEMPLARY EMBODIMENTS

Hereinafter, one or more exemplary embodiments will be described morefully with reference to the accompanying drawings. Expressions such as“at least one of,” when preceding a list of elements, modify the entirelist of elements but do not modify the individual elements of the list.In the present specification, an “image” may denote a still image for avideo or a moving image, that is, the video itself.

FIG. 1 is a block diagram of an apparatus 100 for encoding an image,according to an exemplary embodiment. Referring to FIG. 1, the apparatus100 for encoding an image includes a maximum coding unit divider 110, anencoding depth determiner 120, an image data encoder 130, and anencoding information encoder 140.

The maximum coding unit divider 110 may divide a current frame or slicebased on a maximum coding unit that is a coding unit of the largestsize. That is, the maximum coding unit divider 110 may divide thecurrent frame or slice into at least one maximum coding unit.

According to an exemplary embodiment, a coding unit may be representedusing a maximum coding unit and a depth. As described above, the maximumcoding unit indicates a coding unit having the largest size from amongcoding units of the current frame, and the depth indicates a degree ofhierarchically decreasing the coding unit. As a depth increases, acoding unit may decrease from a maximum coding unit to a minimum codingunit, wherein a depth of the maximum coding unit is defined as a minimumdepth and a depth of the minimum coding unit is defined as a maximumdepth. Since the size of a coding unit decreases from a maximum codingunit as a depth increases, a sub coding unit of a k^(th) depth mayinclude a plurality of sub coding units of a (k+n)^(th) depth (where kand n are integers equal to or greater than 1.

According to an increase of the size of a frame to be encoded, encodingan image in a greater coding unit may cause a higher image compressionratio. However, if a greater coding unit is fixed, an image may not beefficiently encoded by reflecting continuously changing imagecharacteristics.

For example, when a smooth area such as the sea or sky is encoded, thegreater a coding unit is, the more a compression ration may increase.However, when a complex area such as people or buildings is encoded, thesmaller a coding unit is, the more a compression ration may increase.

Accordingly, according to an exemplary embodiment, a different maximumimage coding unit and a different maximum depth may be set for eachframe or slice. Since a maximum depth denotes the maximum number oftimes by which a coding unit may decrease, the size of each minimumcoding unit included in a maximum image coding unit may be variably setaccording to a maximum depth. The maximum depth may be determineddifferently for each frame or slice or for each maximum coding unit.

The encoding depth determiner 120 determines a division shape of themaximum coding unit. The division shape may be determined based oncalculation of rate-distortion (RD) costs. The determined division shapeof the maximum coding unit is provided to the encoding informationencoder 140, and image data according to maximum coding units isprovided to the image data encoder 130.

A maximum coding unit may be divided into sub coding units havingdifferent sizes according to different depths, and the sub coding unitshaving different sizes, which are included in the maximum coding unit,may be predicted or transformed based on processing units havingdifferent sizes. In other words, the apparatus 100 for encoding an imagemay perform a plurality of processing operations for image encodingbased on processing units having various sizes and various shapes. Toencode image data, processing operations, such as at least one ofprediction, transform, and entropy encoding, are performed, whereinprocessing units having the same size or different sizes may be used forthe processing operations, respectively.

For example, the apparatus 100 for encoding an image may select aprocessing unit that is different from a coding unit to predict thecoding unit.

When the size of a coding unit is 2N×2N (where N is a positive integer),processing units for prediction may be 2N×2N, 2N×N, N×2N, and N×N. Inother words, motion prediction may be performed based on a processingunit having a shape whereby at least one of the height and width of acoding unit is equally divided by two. Hereinafter, a processing unit,which is the base of prediction, is defined as a ‘prediction unit’.

A prediction mode may be at least one of an intra mode, an inter mode,and a skip mode, and a specific prediction mode may be performed foronly a prediction unit having a specific size or shape. For example, theintra mode may be performed for only prediction units having the sizesof 2N×2N and N×N of which the shape is a square. Further, the skip modemay be performed for only a prediction unit having the size of 2N×2N. Ifa plurality of prediction units exist in a coding unit, the predictionmode with the least encoding errors may be selected after performingprediction for every prediction unit.

Alternatively, the apparatus 100 for encoding an image may performtransform on image data, based on a processing unit having a differentsize from a coding unit. For the transform in the coding unit, thetransform may be performed based on a processing unit having a sizeequal to or smaller than that of the coding unit. Hereinafter, aprocessing unit, which is the base of transform, is defined as a‘transform unit’. The transform may be discrete cosine transform (DCT)or Karhunen Loeve transform (KLT) or any other fixed point spatialtransform.

The encoding depth determiner 120 may determine sub coding unitsincluded in a maximum coding unit by using RD optimization based on aLagrangian multiplier. In other words, the encoding depth determiner 120may determine which shape a plurality of sub coding units divided fromthe maximum coding unit have, wherein the plurality of sub coding unitshave different sizes according to their depths. The image data encoder130 outputs a bitstream by encoding the maximum coding unit based on thedivision shapes determined by the encoding depth determiner 120.

The encoding information encoder 140 encodes information about anencoding mode of the maximum coding unit determined by the encodingdepth determiner 120. In other words, the encoding information encoder140 outputs a bitstream by encoding information about a division shapeof the maximum coding unit, information about the maximum depth, andinformation about an encoding mode of a sub coding unit for each depth.The information about the encoding mode of the sub coding unit mayinclude information about a prediction unit of the sub coding unit,information about a prediction mode for each prediction unit, andinformation about a transform unit of the sub coding unit.

The information about the division shape of the maximum coding unit maybe information, e.g., flag information, indicating whether each codingunit is divided. For example, when the maximum coding unit is dividedand encoded, information indicating whether the maximum coding unit isdivided is encoded. Also, when a sub coding unit divided from themaximum coding unit is divided and encoded, information indicatingwhether the sub coding unit is divided is encoded.

Since sub coding units having different sizes exist for each maximumcoding unit and information about an encoding mode must be determinedfor each sub coding unit, information about at least one encoding modemay be determined for one maximum coding unit.

The apparatus 100 for encoding an image may generate sub coding units byequally dividing both the height and width of a maximum coding unit bytwo according to an increase of depth. That is, when the size of acoding unit of a k^(th) depth is 2N×2N, the size of a coding unit of a(k+1)^(th) depth is N×N.

Accordingly, the apparatus 100 for encoding an image may determine anoptimal division shape for each maximum coding unit, based on sizes ofmaximum coding units and a maximum depth in consideration of imagecharacteristics. By variably adjusting the size of a maximum coding unitin consideration of image characteristics and encoding an image throughdivision of a maximum coding unit into sub coding units of differentdepths, images having various resolutions may be more efficientlyencoded.

FIG. 2 is a block diagram of an apparatus 200 for decoding an imageaccording to an exemplary embodiment. Referring to FIG. 2, the apparatus200 for decoding an image includes an image data acquisition unit 210,an encoding information extractor 220, and an image data decoder 230.

The image data acquisition unit 210 acquires image data according tomaximum coding units by parsing a bitstream received by the apparatus200 for decoding an image, and outputs the image data to the image datadecoder 230. The image data acquisition unit 210 may extract informationabout maximum coding units of a current frame or slice from a header ofthe current frame or slice. In other words, the image data acquisitionunit 210 divides the bitstream according to the maximum coding units sothat the image data decoder 230 may decode the image data according tothe maximum coding units.

The encoding information extractor 220 extracts information about amaximum coding unit, a maximum depth, a division shape of the maximumcoding unit, and an encoding mode of sub coding units from the header ofthe current frame by parsing the bitstream received by the apparatus 200for decoding an image. The information about the division shape and theinformation about the encoding mode are provided to the image datadecoder 230.

The information about the division shape of the maximum coding unit mayinclude information about sub coding units having different sizesaccording to depths and included in the maximum coding unit, and may beinformation (e.g., flag information) indicating whether each coding unitis divided. The information about the encoding mode may includeinformation about a prediction unit according to sub coding units,information about a prediction mode, and information about a transformunit.

The image data decoder 230 restores the current frame by decoding imagedata of each maximum coding unit, based on the information extracted bythe encoding information extractor 220.

The image data decoder 230 may decode the sub coding units included in amaximum coding unit, based on the information about the division shapeof the maximum coding unit. The decoding may include intra prediction,inter prediction that includes motion compensation, and inversetransform.

The image data decoder 230 may perform intra prediction or interprediction based on information about a prediction unit and informationabout a prediction mode in order to predict a prediction unit. The imagedata decoder 230 may also perform inverse transform for each sub codingunit based on information about a transform unit of a sub coding unit.

FIG. 3 illustrates hierarchical coding units according to an exemplaryembodiment. Referring to FIG. 3, the hierarchical coding units mayinclude coding units whose widths and heights are 64×64, 32×32, 16×16,8×8, and 4×4. Besides these coding units having perfect square shapes,coding units whose width and heights are 64×32, 32×64, 32×16, 16×32,16×8, 8×16, 8×4, and 4×8 may also exist.

Referring to FIG. 3, for image data 310 whose resolution is 1920×1080,the size of a maximum coding unit is set to 64×64, and a maximum depthis set to 2.

For image data 320 whose resolution is 1920×1080, the size of a maximumcoding unit is set to 64×64, and a maximum depth is set to 3. For imagedata 330 whose resolution is 352×288, the size of a maximum coding unitis set to 16×16, and a maximum depth is set to 1.

When the resolution is high or the amount of data is great, a maximumsize of a coding unit may be relatively great to increase a compressionratio and exactly reflect image characteristics. Accordingly, for theimage data 310 and 320 having higher resolution than the image data 330,64×64 may be selected as the size of a maximum coding unit.

A maximum depth indicates the total number of layers in the hierarchicalcoding units. Since the maximum depth of the image data 310 is 2, acoding unit 315 of the image data 310 may include a maximum coding unitwhose longer axis size is 64 and sub coding units whose longer axissizes are 32 and 16, according to an increase of a depth.

On the other hand, since the maximum depth of the image data 330 is 1, acoding unit 335 of the image data 330 may include a maximum coding unitwhose longer axis size is 16 and coding units whose longer axis sizesare 8 and 4, according to an increase of a depth.

However, since the maximum depth of the image data 320 is 3, a codingunit 325 of the image data 320 may include a maximum coding unit whoselonger axis size is 64 and sub coding units whose longer axis sizes are32, 16, 8 and 4 according to an increase of a depth. Since an image isencoded based on a smaller sub coding unit as a depth increases, thecurrent exemplary embodiment is suitable for encoding an image includingmore minute scenes.

FIG. 4 is a block diagram of an image encoder 400 based on a codingunit, according to an exemplary embodiment. An intra prediction unit 410performs intra prediction on prediction units of the intra mode in acurrent frame 405, and a motion estimator 420 and a motion compensator425 perform inter prediction and motion compensation on prediction unitsof the inter mode by using the current frame 405 and a reference frame495.

Residual values are generated based on the prediction units output fromthe intra prediction unit 410, the motion estimator 420, and the motioncompensator 425, and are then output as quantized transform coefficientsby passing through a transformer 430 and a quantizer 440.

The quantized transform coefficients are restored to the residual valuesby passing through an inverse quantizer 460 and an inverse transformer470, are post-processed by passing through a deblocking unit 480 and aloop filtering unit 490, and are then output as the reference frame 495.The quantized transform coefficients may be output as a bitstream 455 bypassing through an entropy encoder 450.

To perform encoding based on an encoding method according to anexemplary embodiment, components of the image encoder 400, i.e., theintra prediction unit 410, the motion estimator 420, the motioncompensator 425, the transformer 430, the quantizer 440, the entropyencoder 450, the inverse quantizer 460, the inverse transformer 470, thedeblocking unit 480, and the loop filtering unit 490, may perform imageencoding processes, based on a maximum coding unit, sub coding unitsaccording to depths, a prediction unit, and a transform unit.

FIG. 5 is a block diagram of an image decoder 500 based on a codingunit, according to an exemplary embodiment. Referring to FIG. 5, abitstream 505 is parsed by a parser 510 in order to obtain encoded imagedata to be decoded and encoding information which is necessary fordecoding. The encoded image data is output as inverse-quantized data bypassing through an entropy decoder 520 and an inverse quantizer 530, andis restored to residual values by passing through an inverse transformer540. The residual values are restored according to coding units by beingadded to an intra prediction result of an intra prediction unit 550 or amotion compensation result of a motion compensator 560. The restoredcoding units are used for prediction of next coding units or a nextframe by passing through a deblocking unit 570 and a loop filtering unit580.

To perform decoding based on a decoding method according to an exemplaryembodiment, components of the image decoder 500, i.e., the parser 510,the entropy decoder 520, the inverse quantizer 530, the inversetransformer 540, the intra prediction unit 550, the motion compensator560, the deblocking unit 570, and the loop filtering unit 580, mayperform image decoding processes based on a maximum coding unit, subcoding units according to depths, a prediction unit, and a transformunit.

In particular, the intra prediction unit 550 and the motion compensator560 determine a prediction unit and a prediction mode in a sub codingunit by considering a maximum coding unit and a depth, and the inversetransformer 540 performs inverse transform by considering the size of atransform unit.

FIG. 6 illustrates a maximum coding unit, a sub coding unit, and aprediction unit, according to an exemplary embodiment. The apparatus 100for encoding an image illustrated in FIG. 1 and the apparatus 200 fordecoding an image illustrated in FIG. 2 use hierarchical coding units toperform encoding and decoding in consideration of image characteristics.A maximum coding unit and a maximum depth may be adaptively setaccording to the image characteristics or variously set according torequirements of a user.

In FIG. 6, a hierarchical coding unit structure 600 has a maximum codingunit 610 whose height and width are 64 and maximum depth is 4. A depthincreases along a vertical axis of the hierarchical coding unitstructure 600, and as a depth increases, the heights and widths of subcoding units 620 to 650 decrease. Prediction units of the maximum codingunit 610 and the sub coding units 620 to 650 are shown along ahorizontal axis of the hierarchical coding unit structure 600.

The maximum coding unit 610 has a depth of 0 and the size of a codingunit, i.e., height and width, of 64×64. A depth increases along thevertical axis, and there exist a sub coding unit 620 whose size is 32×32and depth is 1, a sub coding unit 630 whose size is 16×16 and depth is2, a sub coding unit 640 whose size is 8×8 and depth is 3, and a subcoding unit 650 whose size is 4×4 and depth is 4. The sub coding unit650 whose size is 4×4 and depth is 4 is a minimum coding unit, and theminimum coding unit may be divided into prediction units, each of whichis less than the minimum coding unit.

Referring to FIG. 6, examples of a prediction unit are shown along thehorizontal axis according to each depth. That is, a prediction unit ofthe maximum coding unit 610 whose depth is 0 may be a prediction unitwhose size is equal to the coding unit 610, i.e., 64×64, or a predictionunit 612 whose size is 64×32, a prediction unit 614 whose size is 32×64,or a prediction unit 616 whose size is 32×32, which has a size smallerthan the coding unit 610 whose size is 64×64.

A prediction unit of the coding unit 620 whose depth is 1 and size is32×32 may be a prediction unit whose size is equal to the coding unit620, i.e., 32×32, or a prediction unit 622 whose size is 32×16, aprediction unit 624 whose size is 16×32, or a prediction unit 626 whosesize is 16×16, which has a size smaller than the coding unit 620 whosesize is 32×32.

A prediction unit of the coding unit 630 whose depth is 2 and size is16×16 may be a prediction unit whose size is equal to the coding unit630, i.e., 16×16, or a prediction unit 632 whose size is 16×8, aprediction unit 634 whose size is 8×16, or a prediction unit 636 whosesize is 8×8, which has a size smaller than the coding unit 630 whosesize is 16×16.

A prediction unit of the coding unit 640 whose depth is 3 and size is8×8 may be a prediction unit whose size is equal to the coding unit 640,i.e., 8×8, or a prediction unit 642 whose size is 8×4, a prediction unit644 whose size is 4×8, or a prediction unit 646 whose size is 4×4, whichhas a size smaller than the coding unit 640 whose size is 8×8.

Finally, the coding unit 650 whose depth is 4 and size is 4×4 is aminimum coding unit and a coding unit of a maximum depth, and aprediction unit of the coding unit 650 may be a prediction unit 650whose size is 4×4, a prediction unit 652 having a size of 4×2, aprediction unit 654 having a size of 2×4, or a prediction unit 656having a size of 2×2.

FIG. 7 illustrates a coding unit and a transform unit, according to anexemplary embodiment. The apparatus 100 for encoding an imageillustrated in FIG. 1 and the apparatus 200 for decoding an imageillustrated in FIG. 2 perform encoding and decoding with a maximumcoding unit itself or with sub coding units, which are equal to orsmaller than the maximum coding unit, divided from the maximum codingunit. In the encoding and decoding process, the size of a transform unitfor transform may be selected to be no larger than that of acorresponding coding unit. For example, referring to FIG. 7, when acurrent coding unit 710 has the size of 64×64, transform may beperformed using a transform unit 720 having the size of 32×32.

FIGS. 8A through 8D illustrate division shapes of a coding unit, aprediction unit, and a transform unit, according to an exemplaryembodiment. Specifically, FIGS. 8A and 8B illustrate a coding unit and aprediction unit according to an exemplary embodiment.

FIG. 8A shows a division shape selected by the apparatus 100 forencoding an image illustrated in FIG. 1, in order to encode a maximumcoding unit 810. The apparatus 100 for encoding an image divides themaximum coding unit 810 into various shapes, performs encoding thereon,and selects an optimal division shape by comparing encoding results ofthe various division shapes with each other based on R-D costs. When itis optimal that the maximum coding unit 810 is encoded as it is, themaximum coding unit 810 may be encoded without dividing the maximumcoding unit 810 as illustrated in FIGS. 8A through 8D.

Referring to FIG. 8B, the maximum coding unit 810 whose depth is 0 isencoded by dividing it into sub coding units whose depths are equal toor greater than 1. That is, the maximum coding unit 810 is divided intofour sub coding units whose depths are 1, and all or some of the subcoding units whose depths are 1 are divided into sub coding units whosedepths are 2.

A sub coding unit located in an upper-right side and a sub coding unitlocated in a lower-left side among the sub coding units whose depths are1 are divided into sub coding units whose depths are equal to or greaterthan 2. Some of the sub coding units whose depths are equal to orgreater than 2 may be divided into sub coding units whose depths areequal to or greater than 3.

FIG. 8B shows a division shape of a prediction unit for the maximumcoding unit 810. Referring to FIG. 8B, a prediction unit 860 for themaximum coding unit 810 may be divided differently from the maximumcoding unit 810. In other words, a prediction unit for each of subcoding units may be smaller than a corresponding sub coding unit.

For example, a prediction unit for a sub coding unit 854 located in alower-right side among the sub coding units whose depths are 1 may besmaller than the sub coding unit 854. In addition, prediction units forsome sub coding units 814, 816, 850, and 852 from among sub coding units814, 816, 818, 828, 850, and 852 whose depths are 2 may be smaller thanthe sub coding units 814, 816, 850, and 852, respectively.

In addition, prediction units for sub coding units 822, 832, and 848whose depths are 3 may be smaller than the sub coding units 822, 832,and 848, respectively. The prediction units may have a shape wherebyrespective sub coding units are equally divided by two in a direction ofheight or width or have a shape whereby respective sub coding units areequally divided by four in directions of height and width.

FIGS. 8C and 8D illustrate a prediction unit and a transform unit,according to an exemplary embodiment.

FIG. 8C shows a division shape of a prediction unit for the maximumcoding unit 810 shown in FIG. 8B, and FIG. 8D shows a division shape ofa transform unit of the maximum coding unit 810.

Referring to FIG. 8D, a division shape of a transform unit 870 may beset differently from the prediction unit 860.

For example, even though a prediction unit for the coding unit 854 whosedepth is 1 is selected with a shape whereby the height of the codingunit 854 is equally divided by two, a transform unit may be selectedwith the same size as the coding unit 854. Likewise, even thoughprediction units for coding units 814 and 850 whose depths are 2 areselected with a shape whereby the height of each of the coding units 814and 850 is equally divided by two, a transform unit may be selected withthe same size as the original size of each of the coding units 814 and850.

A transform unit may be selected with a smaller size than a predictionunit. For example, when a prediction unit for the coding unit 852 whosedepth is 2 is selected with a shape whereby the width of the coding unit852 is equally divided by two, a transform unit may be selected with ashape whereby the coding unit 852 is equally divided by four indirections of height and width, which has a smaller size than the shapeof the prediction unit.

FIG. 9 is a block diagram of an image interpolation apparatus 900according to an exemplary embodiment. Image interpolation may be used toconvert an image having a low resolution to an image having a highresolution. Also, image interpolation may be used to convert aninterlaced image to a progressive image or may be used to up-sample animage having a low resolution to a higher resolution. When the imageencoder 400 of FIG. 4 encodes an image, the motion estimator 420 and themotion compensator 425 may perform inter prediction by using aninterpolated reference frame. That is, referring to FIG. 4, an imagehaving a high resolution may be generated by interpolating the referenceframe 495, and motion estimation and compensation may be performed basedon the image having the high resolution, thereby increasing theprecision of inter prediction. Likewise, when the image decoder 500 ofFIG. 5 decodes an image, the motion compensator 550 may perform motioncompensation by using an interpolated reference frame, therebyincreasing the precision of inter prediction.

Referring to FIG. 9, the image interpolation apparatus 900 includes atransformer 910 and an inverse transformer 920.

The transformer 910 transforms pixel values by using a plurality ofbasis functions having different frequencies. The transform may be oneof various processes of transforming pixel values in a spatial domaininto frequency-domain coefficients, and may be, for example, DCT asdescribed above. Pixel values of an integer pixel unit are transformedusing the plurality of basis functions. The pixel values may be pixelvalues of luminance components or of chroma components. The type of theplurality of basis functions is not limited, and may be one of varioustypes of functions for transforming pixel values in a spatial domaininto a frequency-domain value(s). For example, the plurality of basisfunctions may be cosine functions for performing DCT or inverse DCT.Also, various types of basis functions, such as sine basis functions orpolynomial basis functions, may be used. Examples of DCT may includemodified DCT, and modified DCT that uses windowing.

The inverse transformer 920 shifts the phases of the plurality of basisfunctions used for performing transform by the transformer 910, andinverse transforms a plurality of coefficients, i.e., thefrequency-domain values, which are generated by the transformer 910, byusing the plurality of basis functions, the phases of which are shifted.Transform performed by the transformer 910 and inverse transformperformed by the inverse transformer 920 will now be described by usingtwo-dimensional (2D) DCT and one-dimensional (1D) DCT.

<2D DCT and 2D Inverse DCT>

FIG. 10 is a diagram illustrating a 2D interpolation method performed bythe image interpolation apparatus 900 of FIG. 9, according to anexemplary embodiment. Referring to FIG. 10, the image interpolationapparatus 900 generates pixel values on locations X, i.e., interpolationlocations, by interpolating between pixel values of integer pixel unitsin the spatial domain, e.g., pixel values on locations O in a block1000. The pixel values on the locations X are pixel values of fractionalpixel units, the interpolation locations of which are determined by‘α_(x)’ and ‘α_(y)’. Although FIG. 10 illustrates a case where the block1000 has a size of 4×4, the size of the block 1000 is not limited to4×4, and it would be obvious to those of ordinary skill in the art thatpixel values of fractional pixel units may be generated by performing 2DDCT and 2D inverse DCT on a block that is smaller or larger than theblock 1000.

First, the transformer 910 performs 2D DCT on the pixel values of theinteger pixel units. 2D DCT may be performed according to the followingequation:C=D(x)×REF×D(y)  (1),wherein ‘C’ denotes a block that includes frequency-domain coefficientsobtained by performing 2D DCT, ‘REF’ denotes the block 1000 on which DCTis performed, ‘D(x)’ is a matrix for performing DCT in the X-axisdirection, i.e., the horizontal direction, and ‘D(y)’ denotes a matrixfor performing DCT in the Y-axis direction, i.e., the verticaldirection. Here, ‘D(x)’ and ‘D(y)’ may be defined by the followingequation (2):

$\begin{matrix}{{{D_{kl}(x)} = {\frac{2}{S_{x}}{\cos\left( \frac{\left( {{2\; l} + 1} \right)k\;\pi}{2\; S_{x}} \right)}}}{O \leq k \leq {S_{x} - 1}}{{O \leq l \leq {S_{x} - 1}},}} & (2)\end{matrix}$wherein ‘k’ and ‘l’ denote integers each satisfying the conditionexpressed in Equation (2), ‘D_(kl)(x)’ denotes a k^(th) row and anl^(th) column of a square matrix D(x), and S_(x) denotes the horizontaland vertical sizes of the square matrix D(x).

$\begin{matrix}{{{D_{kl}(y)} = {\frac{2}{S_{y}}{\cos\left( \frac{\left( {{2\; l} + 1} \right)k\;\pi}{2\; S_{y}} \right)}}}{O \leq k \leq {S_{y} - 1}}{{O \leq l \leq {S_{y} - 1}},}} & (3)\end{matrix}$wherein ‘k’ and ‘l’ denote integers each satisfying the conditionexpressed in Equation (3), D_(kl)(y) denotes a k^(th) row and an l^(th)column of a square matrix D(y), and S_(y) denotes the horizontal andvertical sizes of the square matrix D(y).

The transformer 910 performs 2D DCT on the block 1000 by calculatingEquation (1), and the inverse transformer 910 performs 2D inverse DCT onthe frequency-domain coefficients generated by the transformer 910 bycalculating the following equation:P=W(x)×D(x)×REF×D(y)×W(y)  (4),wherein ‘P’ denotes a block including pixel values on an interpolationlocation, i.e., the location X, which are obtained by performing inverseDCT. Compared to Equation (1), Equation (4) is obtained by multiplyingboth sides of the block C by ‘W(x)’ and ‘W(y)’, respectively, so as toperform inverse DCT on the block C. Here, ‘W(x)’ denotes a matrix forperforming inverse DCT in the horizontal direction, and ‘W(y)’ denotesperforming inverse DCT in the vertical direction.

As described above, the inverse transformer 910 uses the plurality ofbasis functions, the phases of which are shifted, so as to perform 2Dinverse DCT. ‘W(x)’ and ‘W(y)’ may be defined by the following equations(5) and (6):

$\begin{matrix}{{{{W_{l\; 0}(x)} = \frac{1}{2}}{W_{lk}(x)} = {\cos\left( \frac{\left( {{2\; l} + 1 + {2\;\alpha_{x}}} \right)k\;\pi}{2\; S_{x}} \right)}},{O \leq k \leq {S_{x} - 1}},{O \leq l \leq {S_{x} - 1}},} & (5)\end{matrix}$wherein ‘l’ and ‘k’ denote integers each satisfying the conditionexpressed in Equation (5), ‘W_(lk)(x)’ denotes an l^(th) row and ak^(th) column of a square matrix W(x), and S_(x) denotes the horizontaland vertical sizes of the square matrix W(x). α_(x) denotes a horizontalinterpolation location as illustrated in FIG. 10, and may be afractional number, e.g., ½, ¼, ¾, ⅛, ⅜, ⅝, ⅞, 1/16, or . . . . However,the fractional number is not limited thereto, and α_(x) may be a realnumber.

$\begin{matrix}{{{W_{l\; 0}(y)} = \frac{1}{2}}{{{W_{lk}(y)} = {\cos\left( \frac{\left( {{2\; l} + 1 + {2\;\alpha_{y}}} \right)k\;\pi}{2\; S_{y}} \right)}},{O \leq k \leq {S_{y} - 1}},{O \leq l \leq {S_{y} - 1}},}} & (6)\end{matrix}$wherein ‘l’ and ‘k’ denote integers each satisfying the conditionexpressed in Equation (6), ‘W_(lk)(y)’ denotes an l^(th) row and ank^(th) column of a square matrix W(y), and S_(y) denotes the horizontaland vertical sizes of the square matrix W(y). α_(y) denotes a verticalinterpolation location as illustrated in FIG. 10, and may be afractional number, e.g., ½, ¼, ¾, ⅛, ⅜, ⅝, ⅞, 1/16, or . . . . However,the fractional number is not limited thereto, and α_(y) may be a realnumber.

Compared to Equations (2) and (3), the phases of the plurality of basisfunctions used by the inverse transformer 910, i.e., a plurality ofcosine functions, are shifted by 2α_(x) and 2α_(y), respectively, inEquations (5) and (6). If the inverse transformer 910 performs 2Dinverse DCT based on the plurality of cosine functions, the phases ofwhich are shifted, as expressed in Equations (5) and (6), then the pixelvalues of the locations X are generated.

FIG. 11 is a diagram illustrating an interpolation region 1110 accordingto an exemplary embodiment. When the transformer 910 and the inversetransformer 920 of FIG. 9 generate pixel values on interpolationlocations by performing 2D DCT and 2D inverse DCT, respectively, aregion 1120 that is larger than a block that is to be interpolated,i.e., an interpolation region 1110, may be used. In general, theprecision of interpolation may be lowered at the borders of theinterpolation region 1110, and thus, the correlation between pixelvalues adjacent to an interpolation location may be considered forinterpolation. The image interpolation apparatus 900 of FIG. 9 performs2D DCT on pixel values included in the interpolation region 1110 andthen performs 2D inverse DCT on the result of performing the 2D DCT,wherein the correlation between the pixel values included in theinterpolation region 1110 and pixel values outside the interpolationregion 1110 is not considered.

Thus, the image interpolation apparatus 900 performs interpolation onthe region 1120, which is larger than the interpolation region 1110 andincludes the interpolation region 1110 and a region adjacent to theinterpolation region 1110, and uses the pixel values in theinterpolation region 1110 for motion compensation.

<1D DCT and 1D Inverse DCT>

FIG. 12 is a diagram illustrating a 1D interpolation method according toan exemplary embodiment. Referring to FIG. 12, the image interpolationapparatus 900 of FIG. 9 generates a pixel value 1200 on an interpolationlocation by interpolating between a pixel value 1210 and a pixel value1220 of integer pixel units in a spatial domain. The pixel value 1200 isa pixel value of a fractional pixel unit, the interpolation location ofwhich is determined by ‘α’. The 1D interpolation method according to thecurrent exemplary embodiment will be described below in detail withreference to FIG. 13.

FIG. 13 is a diagram specifically illustrating a 1D interpolation methodperformed by the image interpolation apparatus 900 of FIG. 9, accordingto an exemplary embodiment. Referring to FIG. 13, a plurality ofadjacent pixel values 1310 and 1320 that include pixel values 1210 and1220 of integer pixel units, respectively, are used to generate a pixelvalue 1200 of a fractional pixel unit by interpolating between the twopixel values 1210 and 1220. In other words, 1D DCT is performed on−(M−1)^(th) to M^(th) pixel values, i.e., 2M pixel values, 1D inverseDCT is performed on the result of performing the 1D DCT, based on aplurality of basis functions, the phases of which are shifted, therebyinterpolating between a 0^(th) pixel and a 1^(st) pixel. FIG. 13illustrates a case where M=6, but ‘M’ is not limited to 6 and may be anypositive integer greater than 0.

Also, FIGS. 12 and 13 illustrate cases where interpolation is performedbetween pixel values adjacent in the horizontal direction, but it wouldbe obvious to those of ordinary skill in the art that the 1Dinterpolation methods of FIGS. 12 and 13 may be used to interpolatebetween pixel values adjacent in the vertical direction or a diagonaldirection (See FIGS. 18A and 18B for more details).

The transformer 910 performs 1D DCT on pixel values of integer pixelunits. The 1D DCT may be performed by calculating the followingequation:

$\begin{matrix}{{C_{k} = {\frac{1}{M}{\sum\limits_{l = {{- M} + 1}}^{M}\;{{p(l)}{\cos\left( \frac{\left( {{2\; l} - 1 + {2\; M}} \right)k\;\pi}{4\; M} \right)}}}}}{{O \leq k \leq {{2\; M} - 1}},}} & (7)\end{matrix}$wherein ‘p(l)’ denotes the −(M−1)^(th) to M^(th) pixel values, forexample, the −5^(th) to 6^(th) pixel values 1310 and 1320 illustrated inFIG. 13, and ‘C_(k)’ denotes a plurality of coefficients obtained byperforming 1D DCT on the pixel values. Here, ‘k’ denotes a positiveinteger satisfying the condition expressed in Equation (7).

When the transformer 910 performs 1D DCT on the pixel values 1310 and1320 by calculating Equation (7), the inverse transformer 920 performs1D inverse DCT on frequency-domain coefficients generated by thetransformer 910 by calculating the following Equation (8).

$\begin{matrix}{{{P(\alpha)} = {\frac{C_{0}}{2} + {\sum\limits_{k = 1}^{{2\; M} - 1}\;{C_{k}{\cos\left( \frac{\left( {{2\;\alpha} - 1 + {2\; M}} \right)k\;\pi}{4\; M} \right)}}}}},} & (8)\end{matrix}$wherein ‘α’ denotes an interpolation location between two pixel valuesas described above with reference to FIG. 13, and may be one of variousfractional numbers, e.g., ½, ¼, ¾, ⅛, ⅜, ⅝, ⅞, 1/16, . . . . Thefractional numbers are not limited, and ‘α’ may be a real number. ‘P(α)’denotes the pixel value 1200 on the interpolation location generated byperforming 1D inverse DCT. Compared to Equation (7), the phase of thecosine function expressed in Equation (8), which is a basis functionused for performing 1D inverse DCT, is determined by the fractionalnumber ‘α’ other than an integer ‘1’, and is thus different from thephase of the basis function used for performing 1D DCT.

FIG. 14 is a block diagram of an image interpolation apparatus 1400according to an exemplary embodiment. Referring to FIG. 14, the imageinterpolation apparatus 1400 includes a filter selector 1410 and aninterpolator 1420. The image interpolation apparatus 900 of FIG. 9transforms an image and inversely transforms the result of transformingbased on a plurality of basis functions, the phases of which areshifted. However, if transform and inverse transform are performedwhenever pixel values are input to the image interpolation apparatus900, the amount of calculation required is large, thereby decreasing theoperating speed of an image processing system.

Thus, image interpolation may be quickly performed in a spatial domainwithout having to transform the spatial domain to a frequency domain bycalculating filter coefficients for performing transform and inversetransform described above and then filtering pixel values in the spatialdomain, which are to be input to the image interpolation apparatus 1400,by using the calculated filter coefficients.

The filter selector 1410 receives information regarding an interpolationlocation and selects a filter to be used for interpolation. As describedabove, the filter is used to transform pixel values based on a pluralityof basis functions having different frequencies and to inverselytransform a plurality of coefficients, which are obtained through thetransform, based on the plurality of basis functions, the phases ofwhich are shifted. The filter coefficients may vary according to aninterpolation location, and the filter is selected according to theinterpolation location.

As described above with reference to FIG. 9, the pixel values aretransformed using the plurality of basis functions having differentfrequencies, and the phases of the plurality of basis functions havingdifferent frequencies are shifted according to the interpolationlocation so as to perform inverse transform. Then, the pixel values onthe interpolation location may be interpolated by inversely transformingthe plurality of coefficients by using the plurality of basis functions,the phases of which are shifted. In other words, if transform isperformed based on pixel values of integer pixel units and inversetransform is performed based on the plurality of basis functions, thephases of which are shifted, according to the interpolation location,then pixel values of at least one fractional pixel unit may be generatedfor various interpolation locations. Thus, the filter selector 1410 ofFIG. 14 presets a plurality of filters for performing transform andperforming inverse transform based on different basis functions, andselects one of the preset filters, based on information regarding aninterpolation location.

The interpolator 1420 performs interpolation by using the filterselected by the filter selector 1410. Specifically, interpolation isperformed by filtering a plurality of pixel values of integer pixelunits based on the selected filter. As the result of interpolation, apixel value(s) on a predetermined interpolation location, i.e., a pixelvalue(s) of a fractional pixel unit, is(are) obtained. Referring to FIG.10, if a block that includes a plurality of pixel values of integerpixel units is filtered with a 2D filter, then a plurality of pixelvalues on interpolation locations, each of which is determined by‘α_(x)’ and ‘α_(y)’, are generated. Referring to FIG. 13, if a row orcolumn including a plurality of pixel values of integer pixel units isfiltered with a 1D filter, then a plurality of pixel values oninterpolations a are generated. Interpolation methods performed usingthe 2D filter and the 1D filter, respectively, will now be describedbelow with reference to the accompanying drawings.

<2D Filter>P=W(x)×D(x)×REF×D(y)×W(y)as described above in relation to Equation (4). This equation may alsobe expressed as follows:P=F(x)×REF×F(y)  (9)wherein ‘F(x)’ denotes a filter for transforming a REF block in thehorizontal direction and for inverse transforming the result oftransforming in the horizontal direction by using the plurality of basisfunctions, the phases of which are shifted. ‘F(y)’ denotes a filter fortransforming the REF block in the vertical direction and for inversetransforming the result of transforming in the vertical direction byusing the plurality of basis functions, the phases of which are shifted.For example, ‘F(x)’ may denote a filter for performing DCT on the REFblock in the horizontal direction, and performing inverse DCT on theresult of performing in the horizontal direction by using a plurality ofcosine functions, the phases of which are shifted. ‘F(y)’ may denote afilter for performing DCT on the REF block in the vertical direction,and performing inverse DCT on the result of performing in the verticaldirection by using a plurality of cosine functions, the phases of whichare shifted.

According to Equations (2), (3), (5), and (6), the filters F(x) and F(y)may be defined by the following Equations (10) and (11):

$\begin{matrix}{{{F_{kl}(x)} = {\sum\limits_{n = 0}^{S_{x} - 1}\;{{W_{kn}(x)}{D_{nl}(x)}}}}{O \leq k \leq {S_{x} - 1}}{{O \leq l \leq {S_{x} - 1}},}} & (10)\end{matrix}$wherein ‘k’ and ‘l’ denote integers each satisfying the conditionexpressed in Equation (10), T_(kl)(x)′ denotes a k^(th) row and a l^(th)column of a matrix F(x), and S_(x) denotes the horizontal and verticalsizes of square matrices W(x) and D(x). Since the square matrices W(x)and D(x) have the same size, the horizontal and vertical sizes thereofare also the same. ‘W_(kn)(x)’ denotes a k^(th) row and a n^(th) columnof the square matrix W(x) described above in relation to Equation (5).D_(nl)(x) denotes an n^(th) row and an l^(th) column of the squarematrix D(x) described above in relation to Equation (2).

$\begin{matrix}{{{F_{kl}(y)} = {\sum\limits_{n = 0}^{S_{y} - 1}\;{{D_{kn}(y)}{W_{nl}(y)}}}}{O \leq k \leq {S_{y} - 1}}{{O \leq l \leq {S_{y} - 1}},}} & (11)\end{matrix}$wherein ‘k’ and ‘l’ denote integers each satisfying the conditionexpressed in Equation (11), ‘F_(kl)(y)’ denotes a k^(th) row and acolumn of a matrix F(y), and S_(y) denotes the horizontal and verticalsizes of square matrices W(y) and D(y). Since the square matrices W(y)and D(y) have the same size, the horizontal and vertical sizes thereofare also the same. ‘W_(nl)(y)’ denotes an n^(th) row and an l^(th)column of the square matrix W(y) described above in relation to Equation(5). ‘D_(kn)(y)’ denotes a k^(th) row and a n^(th) column of the squarematrix D(y) described above in relation to Equation (2).

If interpolation is performed by increasing bit-depths of the filtersF(x) and F(y), the precision of filtering may be improved. Thus,according to an exemplary embodiment, coefficients of the filters F(x)and F(y) are increased by multiplying them by a predetermined value, andan image may be interpolated using these filters including the increasedcoefficients. In this case, Equation (9) may be changed as follows:P=(F′(x)×REF×F′(y))/S ²  (12),wherein ‘F’(x)′ denotes a filter scaled by multiplying the coefficientsof the filter F(x) by a scaling factor ‘S’ and rounding off the resultof multiplication to an integer, and ‘F’(y)′ denotes a filter obtainedby multiplying the coefficients of the filter F(y) by ‘S’ and roundingoff the result of multiplication to an integer. Since interpolation isperformed using the scaled filter, the pixel values on the interpolationlocations are calculated and are then divided by ‘S²’ to compensate forthe scaling effect.

FIG. 15 illustrates 2D interpolation filters according to an exemplaryembodiment. Specifically, FIG. 15 illustrates filter coefficients scaledaccording to Equation (2). That is, FIG. 15 illustrates 2D interpolationfilters F′(x) when ‘α_(x)’ is ¼, ½, and ¾, wherein the 2D interpolationfilters F′(x) are generated by multiplying the coefficients of the 2Dinterpolation filter F(x) by a scaling factor 2¹³. A 2D interpolationfilter F′(y) when ‘α_(y)’ is ¼, ½, and ¾, may be used by transposing thefilter F′(x).

Referring to FIG. 14, if the filter selector 1410 selects one of the 2Dinterpolation filters of FIG. 15 based on an interpolation location, theinterpolator 1420 generates pixel values on the interpolation locationby calculating Equation (9) or (12).

<1D Filter>

1D DCT according to Equation (7) may be expressed as the followingdeterminant:C=D×REF  (13),wherein ‘C’ denotes a (2M×1) matrix for 2M coefficients described abovein relation to Equation (7), and ‘REF’ denotes a (2M×1) matrix for pixelvalues of integer pixel units described above in relation to Equation(7), i.e., P_(−(M-1)), . . . through to P_(M). The total number of pixelvalues used for interpolation, i.e., 2M, denotes the total number oftaps of a 1D interpolation filter. ‘D’ denotes a square matrix for 1DDCT, which may be defined as follows:

$\begin{matrix}{{D_{kl} = {\frac{1}{M}{\cos\left( \frac{\left( {{2\; l} - 1 + {2\; M}} \right)k\;\pi}{4\; M} \right)}}}{{O \leq k \leq {{2\; M} - 1 - \left( {M - 1} \right)} \leq l \leq M},}} & (14)\end{matrix}$wherein ‘k’ and ‘l’ denote integers each satisfying the conditionexpressed in Equation (14), ‘D_(m)’ denotes a k^(th) row and a l^(th)column of a square matrix D for 1D DCT expressed in Equation (13), and‘M’ has been described above in relation to Equation (13).

1D DCT using a plurality of basis functions, the phases of which areshifted, according to Equation (8) may be expressed as the followingdeterminant:P(α)=W(α)×C  (15),wherein ‘P(α)’ is the same as ‘P(α)’ expressed in Equation (8), and‘W(α)’ denotes a (1×2M) matrix for 1D inverse DCT using a plurality ofbasis functions, the phases of which are shifted. ‘W(α)’ may be definedas follows:

$\begin{matrix}{{{W_{0}(\alpha)} = \frac{1}{2}}{{W_{k}(\alpha)} = {\cos\left( \frac{\left( {{2\;\alpha} - 1 + {2\; M}} \right)k\;\pi}{4\; M} \right)}}{1 \leq k \leq {{2\; M} - 1}}} & (16)\end{matrix}$wherein ‘k’ denotes an integer satisfying the condition expressed inEquation (16), and ‘W_(k)(α)’ denotes a k^(th) column of the W(α) matrixdescribed above in relation to Equation (15). A 1D interpolation filterF(α) for performing 1D DCT and 1D inverse DCT that uses a plurality ofbasis functions, the phases of which are shifted, based on Equations(13) and (15), may be defined as follows:

$\begin{matrix}{{{P(\alpha)} = {{F(\alpha)} \times {REF}}}{{F_{l}(\alpha)} = {\sum\limits_{k = 0}^{{2\; M} - 1}\;{{W_{k}(\alpha)}D_{kl}}}}{{O \leq k \leq {{2\; M} - 1 - \left( {M - 1} \right)} \leq l \leq M},}} & (17)\end{matrix}$wherein ‘k’ and ‘l’ denote integers each satisfying the conditionexpressed in Equation (17), ‘F_(l)(α)’ denotes an l^(th) column of thefilter F(α), and ‘W(α)’ and ‘D’ are the same as ‘W(α)’ and ‘D’ expressedin Equation (13).

The precision of filtering may be improved by increasing the bit-depthof the 1D interpolation filter F(α) similar to a 2D interpolationfilter. An image may be interpolated by increasing the coefficients ofthe 1D interpolation filter F(α) by multiplying them with apredetermined value and using the 1D interpolation filter F(α) includingthe increased coefficients.

For example, interpolation may be performed by multiplying the 1Dinterpolation filter F(α) by a scaling factor ‘2^(ScalingBits)’. In thiscase, P(α)=F(α)×REF expressed in Equation (17) may be changed asfollows:

$\begin{matrix}{{{{P(\alpha)} = \left( {{\sum\limits_{l = {{- M} + 1}}^{M}\;{{F_{l}^{t}( \propto )} \cdot {REF}_{1}}} + 2^{{ScalingBits} - 1}} \right)}\operatorname{>>}{ScalingBits}},} & (18)\end{matrix}$wherein F′_(l)(α) denotes a filter scaled by multiplying thecoefficients of the 1D interpolation filter F(α) by the scaling factor‘2^(ScalingBits)’, and rounding off the result of multiplication to aninteger, ‘REF_(l)’ denotes a l^(th) column of the REF matrix expressedin Equation (17), and ‘2^(ScalingBits-1)’, denotes a value added toround off a filtered pixel value. A pixel value on an interpolationlocation a is calculated by multiplying the scaled filter F_(l)(α) by amatrix for pixel values, the result of calculation is rounded off byadding the value ‘2^(ScalingBits −1)’, thereto, and the resultant valueis shifted by an ‘Scaling Bits’ bit so as to compensate for the scalingeffect.

Rounding off used in the Equations described above is just an example ofa method of quantizing filter coefficients. In order to generalize amethod of quantizing filter coefficients for ease of understanding,filter coefficients may be modified and optimized as expressed in thefollowing Equations (19) and (20):(F _(l)(α)−ε)≦f′ _(l)(α)≦(F _(l)(α)+ε)wherein ‘F_(l)(α)’ denotes an l^(th) coefficient of a filter that is notquantized, ‘f’_(l)(α)′ denotes an l^(th) coefficient of the filter thatis quantized, and ‘ε’ denote any real number that may be selectedaccording to a degree of quantization and may be, for example,0.2*F_(l)(α). According to Equation (19), when the l^(th) coefficientF_(l)(α) that is a real number is calculated according to Equation (13)to (17), then the l^(th) coefficient F_(l)(α) is changed to the l^(th)coefficient f_(l)(α) satisfying Equation (19), thereby quantizing thel^(th) coefficient F_(l)(α).

When filter coefficients are scaled by a predetermined scaling factor,quantization according to Equation (19) may be changed as follows:(p*F _(l)(α)−p*ε)≦F′ _(l)(α)≦(p*F _(l)(α)+p*ε)  (20),wherein ‘p’ denotes a scaling factor (which may be ‘2^(ScalingBits)’)and p*F_(l)(α) denotes a scaled filter coefficient. According toEquation (20), ‘p*F_(l)(α)’ is converted to ‘F′_(l)(α)’.

FIGS. 16A to 16F illustrate 1D interpolation filters according toexemplary embodiments. In FIGS. 16A to 16F, the scaled filters describedabove in relation to Equation (18) are illustrated according to thenumber of taps and an interpolation location. Specifically, FIGS. 16A to16F illustrate a 4-tap filter, a 6-tap filter, an 8-tap filter, a 10-tapfilter, a 12-tap filter, and a 14-tap filter, respectively. In FIGS. 16Ato 16F, a scaling factor for filter coefficients is set to ‘256’, i.e.,a ScalingBits is set to ‘8’.

In FIGS. 16A to 16F, the filter coefficients include coefficients forhigh-frequency components, whereby the precision of interpolation andprediction may be increased but image compression efficiency may bedegraded due to the high-frequency components. However, interpolation isperformed to increase image compression efficiency as described abovewith reference to FIG. 9. To solve this problem, the filter coefficientsillustrated in FIGS. 16A to 16F may be adjusted to increase imagecompression efficiency in this case

For example, an absolute value of each of the filter coefficients may bereduced, and each filter coefficient at the midpoint of each filter maybe multiplied by a larger weighted value than weighted values assignedto the other filter coefficients. For example, referring to FIG. 16B, inthe 6-tap filter for generating pixel values on a ½ interpolationlocation, the filter coefficients, {11, −43, 160, 160, −43, 11,} areadjusted in such a manner that absolute values of ‘11’, ‘−43’, and ‘160’may be reduced and only ‘160’ at the midpoint of the 6-tap filter ismultiplied by a weighted value.

FIGS. 17A to 17Y illustrate optimized 1D interpolation filters accordingto exemplary embodiments. The filters illustrated in FIGS. 16A to 16Fmay also be adjusted to easily embody the filter by hardware. WhenEquation (17) or (18) is calculated using a computer, filtercoefficients may be optimized to minimize an arithmetical operation,e.g., bit shifting of binary numbers and addition.

In FIGS. 17A and 17B, the amount of calculation needed to performfiltering for interpolation of each filter is indicated in both “adding”and “shift” units. Each of the filters of FIGS. 17A to 17M includescoefficients optimized to minimize the “adding” and “shift” units on acorresponding interpolation location.

FIGS. 17A and 17B illustrate a 6-tap filter and a 12-tap filteroptimized to interpolate an image with the precision of ¼ pixel scaledby an offset of 8 bits, respectively. FIGS. 17C, 17D, and 17E illustrate8-tap filters optimized to interpolate an image with the precision of ¼pixel scaled by an offset of 8 bits. The 8-tap filters of FIGS. 17C to17E are classified according to at least one of whether filtercoefficients are to be optimized and a method of optimizing filtercoefficients. FIGS. 17F and 17G illustrate 8-tap filters optimized tointerpolate an image with the precision of ¼ pixel scaled by an offsetof 6 bits. The filters of FIGS. 17F and 17G may be classified accordingto a method of optimizing filter coefficients.

FIG. 17H illustrates a 6-tap filter optimized to interpolate an imagewith the precision of ⅛ pixel scaled by an offset of 6 bits. FIG. 17Iillustrates a 6-tap filter optimized to interpolate an image with theprecision of ⅛ pixel scaled by an offset of 8 bits.

FIGS. 17J and 17K illustrate 4-tap filters optimized to interpolate animage with the precision of ⅛ pixel scaled by an offset of 5 bits. Thefilters of FIGS. 17J and 17K may be classified according to a method ofoptimizing filter coefficients. FIGS. 17L and 17M illustrate 4-tapfilters optimized to interpolate an image with the precision of ⅛ pixelscaled by an offset of 8 bits. The filters of FIGS. 17L and 17M may alsobe classified according to a method of optimizing filter coefficients.

FIGS. 17N to 17Y illustrate a 4-tap filter, a 6-tap filter, an 8-tapfilter, a 10-tap filter, and a 12-tap filter optimized to interpolate animage with the precision of ⅛ pixel scaled by an offset of 8 bits,respectively. The filters of FIGS. 17N to 17Y are different from thefilters of FIGS. 17A to 17M in that some of the filter coefficients aredifferent, but are the same as the filters of FIGS. 17A to 17M in that afilter coefficient for interpolating a ⅛ interpolation location issymmetrical with a filter coefficient for interpolating a ⅞interpolation location, a filter coefficient for interpolating a 2/8interpolation location is symmetrical with a filter coefficient forinterpolating a 6/8 interpolation location, and a filter coefficient forinterpolating a ⅜ interpolation location is symmetrical with a filtercoefficient for interpolating a ⅝ interpolation location.

FIGS. 23A to 23E illustrate methods of performing scaling and roundingoff in relation to a 1D interpolation filter, according to exemplaryembodiments.

As described above, interpolation filtering uses DCT and inverse DCT,and the 1D interpolation filter thus includes filter coefficients, theabsolute values of which are less than ‘1’. Thus, as described above inrelation to Equation (12), the filter coefficients are scaled bymultiplying them by ‘2^(offset)’, are rounded off to integers,respectively, and are then used for interpolation.

FIG. 23A illustrates filter coefficients scaled by ‘2^(ScalingBits)’when 1D interpolation filters are 12-tap filters. Referring to FIG. 23A,the filter coefficients have been scaled but are not rounded off tointegers. (rewrite . . . okay?)

FIG. 23B illustrates the result of rounding off the scaled filtercoefficients of FIG. 23A to integers by rounding them off to the tenthdecimal point. Referring to FIG. 23B, some interpolation filters, thesum of rounding off the scaled filter coefficients of which is less than‘256’ from among the 1D interpolation filters. Specifically, the sum ofall the filter coefficients of each of a filter for interpolating pixelvalues on an ⅛ interpolation location, a filter for interpolating pixelvalues on a ⅜ interpolation location, a filter for interpolating pixelvalues on a ⅝ interpolation location, and a filter for interpolatingpixel values on a ⅞ interpolation location, is less than ‘256’. That is,the sum of filter coefficients of a filter scaled by an offset of 8 bitsshould be ‘256’ but an error occurs during rounding off of the filtercoefficients.

That the sums of filter coefficients are not the same means that pixelvalues may vary according to an interpolation location. To solve thisproblem, a normalized filter may be generated by adjusting filtercoefficients. FIG. 23C illustrates a normalized filter generated by thefilter coefficients of the filters illustrated in FIG. 23B.

A comparison of FIGS. 23B and 23C reveals that the sums of all thefilter coefficients are normalized to ‘256’ by adjusting some of thefilter coefficients of the filter for interpolating the pixel values onthe ⅛ interpolation location, the filter for interpolating the pixelvalues on the ⅜ interpolation location, the filter for interpolating thepixel values on the ⅝ interpolation location, and the filter forinterpolating pixel values on the ⅞ interpolation location.

FIGS. 23D and 23E illustrate 8-tap filters that are scaled, and theresult of normalizing the 8-tap filters, respectively. If the 8-tapfilters that are scaled by 2^(offset) are as illustrated in FIG. 23D,then the result of rounding off filter coefficients of the 8-tap filtersof FIG. 23D to integer value and normalizing the result of rounding offin such a manner that the sums of the filter coefficients are ‘256’ maybe as illustrated in FIG. 23E. Referring to FIG. 23E, some of the filtercoefficients are different from the result of rounding off the filtercoefficients of the 8-tap filters illustrated in FIG. 23D. This meansthat some of the filter coefficients are adjusted in such a manner thatthe sums of all the filter coefficients are ‘256’.

As illustrated in FIGS. 23B and 23C, at least one of resultant filtercoefficients obtained by at least one of scaling and rounding off filtercoefficients may be different from the result of normalizing theresultant filter coefficients. Thus, it would be obvious to those ofordinary skill in the art that a 1D interpolation filter, at least onefrom among the filter coefficients of which is changed in apredetermined range of error, e.g., +−1 or +−2, from among the filtersillustrated in FIGS. 16A to 16F or the filters illustrated in 17A to 17Mshould be understood to fall within the scope of exemplary embodiments.

If the filter selector 1410 selects one of the filters illustrated inFIGS. 16A to 16F or FIGS. 17A to 17Y or FIGS. 23A to 23E based on aninterpolation location, then the interpolator 1420 generates pixelvalues on the interpolation location by calculating Equation (17) or(18). The other various factors (such as a direction of interprediction, a type of loop-filter, a position of pixel in a block) mayfurther be considered for the filter selector 1410 to select one of thefilters. A size, i.e., a tap size, of a filter that is to be selectedmay be determined by either the size of a block that is to beinterpolated or a direction of filtering for interpolation. For example,a large filter may be selected when a block that is to be interpolatedis large, and a small filter may be selected to minimize memory accesswhen interpolation is to be performed in the vertical direction.

According to an exemplary embodiment, information regarding filterselection may be additionally encoded. For example, if an image wasinterpolated during encoding of the image, a decoding side should knowthe type of a filter used to interpolate the image so as to interpolateand decode the image by using the same filter used during the encodingof the image. To this end, information specifying the filter used tointerpolate the image may be encoded together with the image. However,when filter selection is performed based on the result of previousencoding of another block, that is, context, information regardingfilter selection does not need to be additionally encoded.

If a pixel value generated by performing interpolation is less than aminimum pixel value or is greater than a maximum pixel value, then thepixel value is changed to the minimum or maximum pixel value. Forexample, if the generated pixel value is less than a minimum pixel valueof 0, it is changed to ‘0’, and if the generated pixel value is greaterthan a maximum pixel value of 255, it is changed to ‘255’.

When interpolation is performed to precisely perform inter predictionduring encoding of an image, information specifying an interpolationfilter may be encoded together with the image. In other words,information regarding the type of the filter selected by the filterselector 1410 may be encoded as an image parameter together with theimage. Since a different type of an interpolation filter may be selectedin coding units or in slice or picture units, information regardingfilter selection may also be encoded in the coding units or the slice orpicture units, together with the image. However, if filter selection isperformed according to an implicit rule, the information regardingfilter selection may not be encoded together with the image.

Methods of performing interpolation by the interpolator 1420 accordingto exemplary embodiments will now be described in detail with referenceto FIGS. 18A, 18B, and 19.

FIGS. 18A and 18B illustrate methods of interpolating pixel values invarious directions by using a 1D interpolation filter, according toexemplary embodiments. Referring to FIGS. 18A and 18B, pixel values oninterpolation locations in various directions may be generated by usinga 1D interpolation filter that may perform 1D DCT on 1D pixel values andperform 1D inverse DCT on the result of performing by using a pluralityof basis functions, the phases of which are shifted.

Referring to FIG. 18A, a pixel value P(α) 1800 on an interpolationlocation a in the vertical direction may be generated by interpolatingbetween a pixel value P₀ 1802 and a pixel value P₁ 1804 that areadjacent in the vertical direction. Compared to the 1D interpolationmethod of FIG. 13, interpolation is performed using pixel values 1810and 1820 arranged in the vertical direction instead of the pixel values1310 and 1320 arranged in the horizontal direction, but theinterpolation method described above in relation to Equations (13) to(18) may also be applied to the method of FIG. 18A.

Similarly, compared to the 1D interpolation method of FIG. 13, in themethod of FIG. 18B, interpolation is performed using pixel values 1840and 1850 arranged in a diagonal direction instead of the pixel values1310 and 1320 arranged in the horizontal direction, but a pixel valueP(α) 1830 on an interpolation location a may be generated byinterpolating between two adjacent pixel values 1832 and 1834 asdescribed above in relation to Equations (13) to (18).

FIG. 19A illustrates a 2D interpolation method according to an exemplaryembodiment. Referring to FIG. 19A, pixel values 1910 to 1950 offractional pixel units may be generated based on pixel values 1900 to1906 of integer pixel units.

Specifically, first, the filter selector 1410 of the image interpolationapparatus 1400 illustrated in FIG. 14 selects a 1D interpolation filterto generate pixel values 1910, 1920, 1930, and 1940 of fractional pixelunits that are present between the pixel values 1900 to 1906 of integerpixel units. As described above with reference to FIG. 14, a differentfilter may be selected according to an interpolation location. Forexample, different filters may be selected for pixel values 1912, 1914,and 1916 of a fractional pixel unit, respectively, so as to interpolatethe pixel value 1910 between two upper pixel values 1900 and 1902. Forexample, a filter for generating the pixel value 1914 of a ½ pixel unitmay be different from a filter for generating the pixel values 1912 and1916 of the same ¼ pixel unit. Also, the pixel values 1912 and 1916 ofthe same ¼ pixel unit may be generated using different filters,respectively. As described above with reference to FIG. 14, a degree ofshifting of the phases of basis functions used to perform inverse DCTvaries according to an interpolation location, and thus, a filter forperforming interpolation is selected according to an interpolationlocation.

Similarly, the pixel values 1920, 1930, and 1940 of different fractionalpixel units present between the pixel values 1900 to 1906 of integerpixel units may be generated based on a 1D interpolation filter selectedaccording to an interpolation location.

If the filter selector 1410 selects a filter for generating the pixelvalues 1910, 1920, 1930, and 1940 of fractional pixel units presentbetween the pixel values 1900 to 1906 of integer pixel units, then theinterpolator 1420 generates the pixel values 1910, 1920, 1930, and 1940of fractional pixel units on interpolation locations, respectively,based on the selected filter. According to an exemplary embodiment,since a filter for generating a pixel value on each of interpolationlocations has been previously calculated, pixel values on all of theinterpolation locations may be generated based on pixel values ofinteger pixel values.

In other words, since the pixel values 1912 and 1916 of the ¼ pixel unitmay be generated directly from the pixel values 1900 and 1920 of aninteger pixel unit, there is no need to first calculate the pixel value1914 of a ½ pixel unit and then generate the pixel values 1912 and 1916of the ¼ pixel unit based on the pixel values 1900 and 1902 of integerpixel units and the pixel value 1914 of the ½ pixel unit. Since imageinterpolation does not need to be performed sequentially according tothe size of a pixel unit, image interpolation may be performed at highspeed.

According to another exemplary embodiment, an interpolation method basedon an interpolation location according to an exemplary embodiment may becombined with a related interpolation method. For example, a pixel valueof a ½ pixel unit and a pixel value of a ¼ pixel unit may be generateddirectly from the pixel values 1900 and 1920 of the integer pixel unitby using an interpolation filter according to an exemplary embodiment,and a pixel value of a ⅛ pixel unit may be generated from the pixelvalue of the ¼ pixel unit by using a related linear interpolationfilter. Otherwise, only the pixel value of the ½ pixel unit may begenerated directly from the pixel values 1900 and 1920 of the integerpixel unit by using the interpolation filter according to an exemplaryembodiment, the pixel value of the ¼ pixel unit may be generated fromthe pixel value of the ½ pixel unit by using the related art linearinterpolation filter, and the pixel value of the ⅛ pixel unit may begenerated from the pixel value of the ¼ pixel unit by using the relatedart linear interpolation filter.

If all of the pixel values 1910, 1920, 1930, and 1940 of the fractionalpixel units present between the pixel values 1900 to 1906 of the integerpixel units are generated by performing interpolation, then the filterselector 1410 selects a 1D interpolation filter again for interpolatingbetween the pixel values 1910, 1920, 1930, and 1940 of the fractionalpixel units. In this case, a different filter is selected according toan interpolation location similar to a manner in which a filter isselected to interpolate between the pixels values 1900 to 1906 of theinteger pixel units.

The interpolator 1420 generates the pixel value 1950 of a fractionalpixel unit corresponding to each of interpolation locations by using thefilter selected by the filter selector 1410. That is, the pixel value1950 of the fractional pixel units between the pixel values 1910, 1920,1930, and 1940 of the fractional pixel units is generated.

FIG. 19B illustrates a 2D interpolation method using a 1D interpolationfilter, according to another exemplary embodiment. Referring to FIG.19B, a pixel value on a 2D interpolation location may be generated byrepeatedly performing interpolation in the vertical and horizontaldirections using the 1D interpolation filter.

Specifically, a pixel value Temp_((i,j)) is generated by interpolatingbetween a pixel value REF_((i,j)) 1960 and a pixel value REF_((i+1, j))1964 of an integer pixel unit in the horizontal direction. Also, a pixelvalue Temp_((i,j+1)) is generated by interpolating between a pixel valueREF_((i,j+1)) 1962 and a pixel value REF_((i+1, j+1)) 1966 in thehorizontal direction. Then, a pixel value P_((i,j)) on a 2Dinterpolation location is generated by interpolating between the pixelvalue Temp_((i,j)) and the pixel value Temp_((i,j+1)) in the verticaldirection.

The 1D interpolation filter may be a filter for performing 1D DCT andperforming 1D inverse DCT based on a plurality of basis functions, thephases of which are shifted. Also, the 1D interpolation filter may be ascaled filter as described above in relation to Equation (17). Wheninterpolation is performed in the horizontal and vertical directionsbased on the scaled filter, interpolation may be performed bycalculating the following Equation (21):

$\begin{matrix}{{{{Temp}_{({i,j})} = \left( {{\sum\limits_{l = {{- M} + l}}^{M}\;{{F_{1}^{\prime}\left( \alpha_{x} \right)} \cdot {REF}_{({{i + l},j})}}} + 2^{{{StageBits}\; 1} - 1}} \right)}\operatorname{>>}{{StageBits}\; 1}}{{{P_{({i,j})} = \left( {{\sum\limits_{l = {{- M} + 1}}^{M}\;{{F_{l}^{\prime}\left( \alpha_{y} \right)} \cdot {Temp}_{({i,{j + l}})}}} + 2^{{{StageBits}\; 2} - 1}} \right)}\operatorname{>>}{{StageBits}\; 2}},}} & (21)\end{matrix}$wherein F′_(l)(α_(x)) and F′_(l)(α_(y)) correspond to F′_(l)(α)expressed in Equation (18). However, since a vertical interpolationlocation may be different from a horizontal interpolation location, adifferent 1D interpolation filter may be selected according to aninterpolation location.

When the horizontal interpolation and the vertical interpolation areperformed, first bit shifting is performed according to StageBits1 afterthe horizontal interpolation and second bit shifting is performedaccording to StageBits2 after the vertical interpolation.(TotalBits=StageBits1+StageBits2) If StageBits1 is set to zero, thefirst bit shifting is not performed.

Thus, if a scaling factor for F_(l)(α_(y)) is ‘2^(bit1)’ and a scalingfactor for F_(l)(α_(x)) is ‘2^(Bit2)’ in Equation (21), then‘TotalBits=‘bit1’+‘bit2’.

FIG. 19C illustrates a 2D interpolation method using a 1D interpolationfilter, according to another exemplary embodiment. Referring to FIG.19C, a pixel value on a 2D interpolation location may be generated byrepeatedly performing interpolation in the vertical and horizontaldirections by using the 1D interpolation filter.

Specifically, a pixel value Temp_((i, j)) is generated by interpolatingbetween a pixel values REF_((i,j)) 1960 and a pixel value REF_((i,j+1))1962 of an integer pixel unit in the vertical direction. Next, aTemp_((i+1, j)) is generated by interpolating between a pixel valueREF_((i, j+1)) 1964 and a pixel value REF_((i+1, j+1)) 1966 in thevertical direction. Then, a pixel value P_((i,j)) on a 2D interpolationlocation is generated by interpolating between the pixel valueTemp_((i,j)) and the pixel value Temp_((i+1,j)). When interpolation isperformed in the horizontal and vertical directions based on a scaledfilter, interpolation may be performed by calculating the followingEquation (22):

$\begin{matrix}{{{{Temp}_{({i,j})} = \left( {{\sum\limits_{l = {{- M} + l}}^{M}\;{{F_{1}^{\prime}\left( \alpha_{y} \right)} \cdot {REF}_{({i,{j + l}})}}} + 2^{{{StageBits}\; 1} - 1}} \right)}\operatorname{>>}{{StageBits}\; 1}}{{{P_{({i,j})} = \left( {{\sum\limits_{l = {{- M} + 1}}^{M}\;{{F_{l}^{\prime}\left( \alpha_{x} \right)} \cdot {Temp}_{({{i + l},j})}}} + 2^{{{StageBits}\; 2} - 1}} \right)}\operatorname{>>}{{StageBits}\; 2}},}} & (22)\end{matrix}$

FIG. 20 is a flowchart illustrating an image interpolation methodaccording to an exemplary embodiment. Referring to FIG. 20, in operation2010, the image interpolation apparatus 900 of FIG. 9 transforms pixelvalues in a spatial domain by using a plurality of basis functionshaving different frequencies. The pixel values may be a plurality ofpixel values included in a predetermined block or may be rows or columnsof pixel values arranged in the horizontal or vertical direction.

Here, the transform may be 2D DCT or 1D DCT described above in relationto the transformer 910 and Equations (1), (2), (3), and (7).

In operation 2020, the image interpolation apparatus 900 shifts thephases of the plurality of basis functions used in operation 2010. Thephases of the plurality of basis functions may be shifted according to a2D interpolation location determined by ‘α_(x)’ and ‘α_(y)’ or accordingto a 1D interpolation location determined by ‘α’.

In operation 2030, the image interpolation apparatus 900 inverselytransforms DCT coefficients, which were obtained by transforming thepixel values in the spatial domain in operation 2010, by using theplurality of basis functions, the phases of which were shifted inoperation 2020. That is, pixel values on interpolation locations aregenerated by inversely transforming the DCT coefficients obtained inoperation 2010.

If the transform performed in operation 2010 is 2D DCT, then inoperation 2030, the image interpolation apparatus 900 generates pixelvalues on 2D interpolation locations by performing 2D inverse DCT on theDCT coefficients by using a plurality of cosine functions, the phases ofwhich are shifted.

If the transform performed in operation 2010 is 1D DCT performed in rowsor columns of pixel values, then in operation 2030, the imageinterpolation apparatus 900 generates pixel values on 1D interpolationlocations by performing 1D inverse DCT on the DCT coefficients by usinga plurality of cosine functions, the phases of which are shifted.

The plurality of basis functions, the phases of which are shifted andinverse transform based thereon, have been described above in relationto the inverse transformer 920 and Equations (4), (5), (6), and (8).

FIG. 21 is a flowchart illustrating an image interpolation methodaccording to another exemplary embodiment. Referring to FIG. 21, inoperation 2110, the image interpolation apparatus 1400 of FIG. 14selects a filter for performing transform and performing inversetransform based on a plurality of basis functions, the phases of whichare shifted, according to an interpolation location. For example, afilter for performing DCT and performing inverse DCT based on aplurality of cosine functions, the phases of which are shifted, isselected according to an interpolation location. If pixel values thatare to be interpolated are included in a predetermined block, then afilter for performing 2D DCT and 2D inverse DCT is selected based on‘α_(x)’ and ‘α_(y)’. If pixel values that are to be interpolated arerows or columns of pixel values, then a filter for performing 1D DCT and1D inverse DCT is selected based on ‘α’. One of the filters describedabove with reference to FIG. 15, FIGS. 16A to 16F, and FIG. 17 may beselected according to an interpolation location. However, the size of afilter may be determined by the various other factors apart from aninterpolation location as described above in relation to the filterselector 1410 and with reference to FIG. 17.

In operation 2120, the image interpolation apparatus 1400 performsinterpolation based on the filter selected in operation 2110. Pixelvalues on a 2D interpolation location or a pixel value on a 1Dinterpolation location may be generated by filtering pixel values in aspatial domain by using the filter selected in operation 2110.Interpolation performed using filtering has been described above inrelation to Equations (9) to (19).

FIG. 22 is a flowchart illustrating an image interpolation methodaccording to another exemplary embodiment. Referring to FIG. 22, inoperation 2210, the image interpolation apparatus 1400 of FIG. 14selects a different filter for interpolating between pixel values 1900to 1906 of integer pixel units, according to an interpolation location.In the current exemplary embodiment, pixel values 1910, 1920, 1930, and1940 of at least one fractional pixel unit may be generated directlyfrom the pixel values 1900 to 1906 of the integer pixel values. Thus,the image interpolation apparatus 1400 selects interpolation filterscorresponding to the interpolation locations, respectively, in operation2210.

In operation 2220, the image interpolation apparatus 1400 generates thepixel values 1910, 1920, 1930, and 1940 of the at least one fractionalpixel unit by interpolating between the pixel values 1900 to 1906 of theinteger pixel units, based on the different filter selected according toeach of interpolation locations in operation 2210.

In operation 2230, the image interpolation apparatus 1400 selects adifferent filter for interpolating between the pixel values 1910, 1920,1930, and 1940 of the at least one fractional pixel unit generated inoperation 2220, according to an interpolation location. A differentfilter for generating the pixel values 1950 of another fractional pixelunit illustrated in FIG. 19, which are present between the pixel values1910, 1920, 1930, and 1940 of the at least one fractional pixel unit, isselected according to an interpolation location.

In operation 2240, the image interpolation apparatus 1400 generates thepixel values 1950 of another fractional pixel unit by interpolating thepixel values 1910, 1920, 1930, and 1940 of the at least one fractionalpixel unit, based on the filter selected in operation 2230.

While exemplary embodiments have been particularly shown and describedabove, it will be understood by one of ordinary skill in the art thatvarious changes in form and details may be made therein withoutdeparting from the spirit and scope of the inventive concept as definedby the following claims and their equivalents. Also, a system accordingto an exemplary embodiment can be embodied as computer readable code ona computer readable recording medium.

For example, each of an apparatus for encoding an image, an apparatusfor decoding an image, an image encoder, and an image decoder accordingto exemplary embodiments as illustrated in FIGS. 1, 2, 4, 5, 9, and 14,may include a bus coupled to units thereof, at least one processorconnected to the bus, and memory that is connected to the bus to store acommand or a received or generated message and is coupled to the atleast one processor to execute the command.

The computer readable recording medium may be any data storage devicethat can store data to be read by a computer system. Examples of thecomputer readable recording medium include read-only memory (ROM),random-access memory (RAM), compact disc (CD)-ROM, magnetic tapes,floppy disks, and optical data storage devices. The computer readablerecording medium can also be distributed over network-coupled computersystems so that the computer readable code may be stored and executed ina distributed fashion.

What is claimed is:
 1. An apparatus for motion compensation, theapparatus comprising: a processor which is configured for determining,in a luma reference picture, a luma reference block for prediction of acurrent block by using a luma motion vector, generating a luma sample ofa 2/4-pixel location by applying an 8-tap interpolation filter to lumasamples of an integer pixel location of the luma reference picture, andgenerating a luma sample of a ¼-pixel location or a ¾-pixel locationincluded in the luma reference block by applying an interpolation filterto the luma samples of the integer pixel location of the luma referencepicture without using the generated luma sample of the 2/4-pixellocation, wherein the processor is configured for determining, in achroma reference picture, a chroma reference block for prediction of thecurrent block by using a chroma motion vector, and generating a chromasample of a 4/8-pixel location included in the chroma reference block,by applying a 4-tap interpolation filter to chroma samples of an integerpixel location of the chroma reference picture, the 8-tap interpolationfilter comprises eight filter coefficients, and the 4-tap interpolationfilter comprises four filter coefficients.
 2. The apparatus of claim 1,wherein the is configured for scaling the luma sample generated byapplying the 8-tap interpolation filter by using a luma scaling factorthat a sum of coefficients of the 8-tap interpolation filter is 1,wherein the luma scaling factor is
 64. 3. The apparatus of claim 1,wherein: an image is split into a plurality of maximum coding units, amaximum coding unit, among the plurality of maximum coding units, ishierarchically split into one or more coding units of depths includingat least one of a current depth and a lower depth according to splitinformation indicating whether a coding unit is split, when the splitinformation indicates a split for the current depth, a coding unit ofthe current depth is split into four coding units of the lower depth,independently from neighboring coding units, and when the splitinformation indicates a non-split for the current depth, at least oneprediction unit of coding unit is obtained from the coding unit of thecurrent depth.